Generalized Opinion Pooling
نویسندگان
چکیده
In this paper we analyze the problem of opinion pooling. We introduce a divergence minimization framework to solve the problem of standard opinion pooling. Our results show that various existing pooling mechanisms like LinOp and LogOp are an special case of this framework. This framework is then extended to address the problem of generalized opinion pooling. We show that this framework does satisfies various desiderata and we give an EM algorithm for solving this problem. Finally we present some results on synthetic and real world data and the results obtained are encouraging.
منابع مشابه
Probabilistic opinion pooling generalized. Part two: the premise-based approach
How can several individualsprobability functions on a given -algebra of events be aggregated into a collective probability function? Classic approaches to this problem usually require event-wise independence: the collective probability for each event should depend only on the individuals probabilities for that event. In practice, however, some events may be basic and others derivative, ...
متن کاملProbabilistic opinion pooling generalized. Part one: general agendas
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events the agenda is a -algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. On...
متن کاملProbabilistic opinion pooling generalized Part two: Premise-based opinion pooling
We consider the classical problem of aggregating di¤erent individualsprobability assignments (opinions) over a -algebra of events. In practice, some events represent basic propositions, such as it rainsor CO2 emissions cause global warming, while others represent combinations thereof, for instance disjunctions (unions) of basic events. It is plausible to treat the basic events as premises ...
متن کاملProbabilistic opinion pooling generalized Part one: General agendas1
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the agendaof relevant events forms a -algebra, hence, is closed under taking disjunctions (unions) or conjunctions (intersections) of events. This assumption is overly demanding: in practice...
متن کاملOpinion pooling on general agendas
How can di¤erent individualsprobability assignments to some events be aggregated into a collective probability assignment? Although there are several classic results on this problem, they all assume that the agendaof relevant events forms a -algebra, an overly demanding assumption for many practical applications. We drop this assumption and explore probabilistic opinion pooling on general ag...
متن کامل